Deterministic dynamic logic is strictly weaker than dynamic logic
نویسندگان
چکیده
منابع مشابه
Non-deterministic semantics for dynamic topological logic
Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...
متن کاملNon-deterministic Semantics for Dynamic Topological Logic
Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...
متن کاملStar-Free Picture Expressions are Strictly Weaker Than First-Order Logic
We exhibit a rst-order deenable picture language which we prove is not expressible by any star-free picture expression, i. e., it is not star-free. Thus rst-order logic over pictures is strictly more powerful than star-free picture expressions are. This is in sharp contrast with the situation with words: the well-known McNaughton-Papert theorem states that a word language is expressible by a rs...
متن کاملGeneral Dynamic Dynamic Logic
Dynamic epistemic logic (DEL) extends purely modal epistemic logic (S5) by adding dynamic operators that change the model structure. Propositional dynamic logic (PDL) extends basic modal logic with programs that allow the definition of complex modalities. We provide a common generalisation: a logic that is ‘dynamic’ in both senses, and one that is not limited to S5 as its modal base. It also in...
متن کاملCoin Tossing is Strictly Weaker Than Bit Commitment
We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites between which special relativity guarantees a time lapse in communication. We show that, under these assumptions, unconditionally secure coin tossing can be carried out by exchanges of classical information. We show also, following Mayers, Lo and Chau, that unconditionall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1983
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(83)80024-2